Modified Backtracking Search Optimization Algorithm Inspired by Simulated Annealing for Constrained Engineering Optimization Problems
نویسندگان
چکیده
منابع مشابه
An Improved Backtracking Search Algorithm for Constrained Optimization Problems
Backtracking search algorithm is a novel population-based stochastic technique. This paper proposes an improved backtracking search algorithm for constrained optimization problems. The proposed algorithm is combined with differential evolution algorithm and the breeder genetic algorithm mutation operator. The differential evolution algorithm is used to accelerate convergence at later iteration ...
متن کاملFOA: ‘Following’ Optimization Algorithm for solving Power engineering optimization problems
These days randomized-based population optimization algorithms are in wide use in different branches of science such as bioinformatics, chemical physics andpower engineering. An important group of these algorithms is inspired by physical processes or entities’ behavior. A new approach of applying optimization-based social relationships among the members of a community is investigated in this pa...
متن کاملA Dual Sequence Simulated Annealing Algorithm for Constrained Optimization
We propose a dual sequence Simulated Annealing algorithm, DSAC, for solving constrained optimization problems. This approach eliminates the need for imposing penalties in the objective function by tracing feasible and infeasible solution sequences independently. We compare DSAC with a similar single sequence algorithm, PSAC, where the objective function is augmented by various penalty forms rel...
متن کاملSimulated annealing for constrained global optimization
Hide-and-Seek is a powerful yet simple and easily implemented continuous simulated annealing algorithm for finding the maximum of a continuous function over an arbitrary closed, bounded and full-dimensional body. The function may be nondifferentiable and the feasible region may be noneonvex or even disconnected. The algorithm begins with any feasible interior point. In each iteration it generat...
متن کاملEFFICIENCY OF IMPROVED HARMONY SEARCH ALGORITHM FOR SOLVING ENGINEERING OPTIMIZATION PROBLEMS
Many optimization techniques have been proposed since the inception of engineering optimization in 1960s. Traditional mathematical modeling-based approaches are incompetent to solve the engineering optimization problems, as these problems have complex system that involves large number of design variables as well as equality or inequality constraints. In order to overcome the various difficultie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Intelligence and Neuroscience
سال: 2018
ISSN: 1687-5265,1687-5273
DOI: 10.1155/2018/9167414